On-Line Monitoring for Temporal Logic Robustness

In this paper, we provide a Dynamic Programming algorithm for on-line monitoring of the state robustness of Metric Temporal Logic specifications with past time operators. We compute the robustness of MTL with unbounded past and bounded future temporal operators MTL over sampled traces of Cyber-Physical Systems. We implemented our tool in Matlab as a Simulink block that can be used in any Simulink model. We experimentally demonstrate that the overhead of the MTL robustness monitoring is acceptable for certain classes of practical specifications

Equivariant cohomology over Lie groupoids and Lie-Rinehart algebras

Using the language and terminology of relative homological algebra, in particular that of derived functors, we introduce equivariant cohomology over a general Lie-Rinehart algebra and equivariant de Rham cohomology over a locally trivial Lie groupoid in terms of suitably defined monads (also known as triples) and the associated standard constructions. This extends a characterization of equivariant de Rham cohomology in terms of derived functors developed earlier for the special case where the Lie groupoid is an ordinary Lie group, viewed as a Lie groupoid with a single object; in that theory over a Lie group, the ordinary Bott-Dupont-Shulman-Stasheff complex arises as an a posteriori object. We prove that, given a locally trivial Lie groupoid G and a smooth G-manifold f over the space B of objects of G, the resulting G-equivariant de Rham theory of f boils down to the ordinary equivariant de Rham theory of a vertex manifold relative to the corresponding vertex group, for any vertex in the space B of objects of G; this implies that the equivariant de Rham cohomology introduced here coincides with the stack de Rham cohomology of the associated transformation groupoid whence this stack de Rham cohomology can be characterized as a relative derived functor. We introduce a notion of cone on a Lie-Rinehart algebra and in particular that of cone on a Lie algebroid. This cone is an indispensable tool for the description of the requisite monads.Comment: 47 page

The well-founded semantics is a stratified Fitting semantics

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. While several different semantics have been proposed, and some have been more successful than others, the exact relationships between the approaches have not yet been fully understood. In this paper, we give new characterizations, using level mappings, of the Fitting semantics, the well-founded semantics, and the weakly perfect model semantics. The results will unmask the well-founded semantics as a stratified version of the Fitting semantics

Thinking ultrametrically, thinking p-adically

The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin's ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures-first of all, clusters, orderings and hierarchies-in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin's fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining and knowledge discovery. Researchers, students and software engineers will benefit from new knowledge discovery techniques and application directions